Notes on Rainbow Distinguished Point Method
نویسنده
چکیده
This paper clarifies the method described in our previous paper (DOI: 978-3-319-02726-5 21), namely rainbow distinguished point method, and give revised theoretical and experimental results which shows rainbow distinguished point method behaves inferiorly to other time memory tradeoff methods.
منابع مشابه
Analysis of the Parallel Distinguished Point Tradeoff
Cryptanalytic time memory tradeoff algorithms are tools for quickly inverting one-way functions and many consider the rainbow table method to be the most efficient tradeoff algorithm. However, it was recently announced, mostly based on experiments, that the parallelization of the perfect distinguished point tradeoff algorithm brings about an algorithm that is 50% more efficient than the perfect...
متن کاملA Comparison of Perfect Table Cryptanalytic Tradeoff Algorithms
The performances of three major time memory tradeoff algorithms were compared in a recent paper. The algorithms considered there were the classical Hellman tradeoff and the non-perfect table versions of the distinguished point method and the rainbow table method. This paper adds the perfect table versions of the distinguished point method and the rainbow table method to the list, so that all th...
متن کاملVariants of the Distinguished Point Method for Cryptanalytic Time Memory Trade-Offs
The time memory trade-off (TMTO) algorithm, first introduced by Hellman, is a method for quickly inverting a one-way function, using pre-computed tables. The distinguished point method (DP) is a technique that reduces the number of table lookups performed by Hellman’s algorithm. In this paper we propose a new variant of the DP technique, named variable DP (VDP), having properties very different...
متن کاملSome Remarks on Rainbow Connectivity
An edge (vertex) coloured graph is rainbow-connected if there is a rainbow path between any two vertices, i.e. a path all of whose edges (internal vertices) carry distinct colours. Rainbow edge (vertex) connectivity of a graph G is the smallest number of colours needed for a rainbow edge (vertex) colouring of G. In this paper we propose a very simple approach to studying rainbow connectivity in...
متن کاملRainbow-free 3-colorings in abelian groups
A 3–coloring of an abelian group G is rainbow–free if there is no 3–term arithmetic progression with its members having pairwise distinct colors. We describe the structure of rainbow–free colorings of abelian groups. This structural description proves a conjecture of Jungić et al. on the size of the smallest chromatic class of a rainbow–free coloring of cyclic groups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1506.00794 شماره
صفحات -
تاریخ انتشار 2015